Forbidden lines of np/q/ ions. I - Detailed balance and line intensity ratios
نویسندگان
چکیده
منابع مشابه
Forbidden and Acceptable Line Trees
The problem of existence of a tree satisfying a given set of constraints on its vertices is considered. Specifically, given finite set of constraints P = {p1, p2, ..., pn}, we ask if there is an efficient algorithm to build a line-tree T = (V, E) such that for every constraint pi = (ab)(cd), where a, b, c, d are arbitrary elements of V , the path (ab) does not share any vertices with the path (...
متن کاملEigenvalues and forbidden subgraphs I
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn (G) be the largest eigenvalue of the Laplacian of G and μn (G) be the smallest eigenvalue of its adjacency matrix, we prove that λn (G) ≥ 2m2 − 3nt m (n2 − 2m) , μn (G) ≤ 3n3t− 4m3 nm (n2 − 2m) , with equality if and only if G is a regular complete multipartite graph. Moreover, if G is Kr+1-free, then λn (G) ≥ 2mn (r − 1) (...
متن کاملCorrelation between Infrared Colors and Intensity Ratios of SiO Maser Lines
We present the results of SiO millimeter-line observations of a sample of known SiO maser sources covering a wide dust-temperature range. A cold part of the sample was selected from the SiO maser sources found in our recent SiO maser survey of cold dusty objects. The aim of the present research is to investigate the causes of the correlation between infrared colors and SiO maser intensity ratio...
متن کاملForbidden Magnification? I
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control in SOMs refers to the modification of the relationship between the probability density functions of the input samples and their prototypes (SOM weights). The above mentioned algorithm enables explicit control of the m...
متن کاملLine Graphs and Forbidden Induced Subgraphs
Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it consists of two complete graphs sharing exactly one common edge. In this paper, we show that a graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Astrophysical Journal Supplement Series
سال: 1980
ISSN: 0067-0049,1538-4365
DOI: 10.1086/190664